翻訳と辞書 Words near each other ・ Lucasidia ・ Lucasium byrnei ・ Lucasium damaeum ・ Lucasium stenodactylum ・ Lucasius ・ Lucasta Miller ・ Lucasuchus ・ LucasVarity ・ Lucasville ・ Lucasville, New South Wales ・ Lucasville, Nova Scotia ・ Lucasville, Ohio ・ Lucas–Carmichael number ・ Lucas–Kanade method ・ Lucas–Lehmer primality test ・ Lucas–Lehmer–Riesel test ・ Lucatumumab ・ Lucava River ・ Lucavsala ・ Lucaya International School ・ Lucaya, Bahamas ・ Lucayablennius zingaro ・ Lucayan ・ Lucayan Archipelago ・ Lucayan Formation ・ Lucayan people ・ Lucazi language ・ Lucban, Quezon ・ Lucbardez-et-Bargues ・ Lucca Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Lucas–Lehmer–Riesel test ： ウィキペディア英語版 Lucas–Lehmer–Riesel test In mathematics, the Lucas–Lehmer–Riesel test is a primality test for numbers of the form ''N'' = ''k'' ⋅ 2''n'' − 1, with 2''n'' > ''k''. The test was developed by Hans Riesel and it is based on the Lucas–Lehmer primality test. It is the fastest deterministic algorithm known for numbers of that form. For numbers of the form ''N'' = ''k'' ⋅ 2''n'' + 1 (Proth numbers), either application of Proth's theorem (a Las Vegas algorithm) or one of the deterministic proofs described in Brillhart-Lehmer-Selfridge 1975 are used. ==The algorithm== The algorithm is very similar to the Lucas–Lehmer test, but with a variable starting point depending on the value of ''k''. Define a sequence for all ''i'' > 0 by: : $u\_i\; =\; u\_^2-2.\; \backslash ,$ Then ''N'' is prime if and only if it divides ''u''''n''−2. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Lucas–Lehmer–Riesel test」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.